A procedure for computing the symmetric difference of regions defined by polygonal curves

نویسندگان

  • Miguel Belbut Gaspar
  • Nelson Martins-Ferreira
چکیده

Given any two regions A, B in the plane, defined by polygonal (simple, closed and oriented) curves, associated with their respective boundaries, we describe a procedure to compute the symmetric difference A⊕B. The output is also presented in the form of polygonal curves, where in particular the curves describing the union A∪B, the intersection A∩B, the difference A\B, and the complement of the difference B\A, are also obtained. This is related with the two equivalent formulas to compute the symmetric difference, namely A⊕B = (A∪B)\(A∩B) = (A\B)∪(B\A).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...

متن کامل

Stress Waves in a Generalized Thermo Elastic Polygonal Plate of Inner and Outer Cross Sections

The stress wave propagation in a generalized thermoelastic polygonal plate of inner and outer cross sections is studied using the Fourier expansion collocation method. The wave equation of motion based on two-dimensional theory of elasticity is applied under the plane strain assumption of generalized thermoelastic plate of polygonal shape, composed of homogeneous isotropic material.  The freque...

متن کامل

Multiple Clothing Part Placement: Direct Representation of Curves vs. Polygonal Approximation

Techniques exist for numerically robust cascaded set operations on planar polygonal regions: Boolean operations (union, intersection, difference) and Minkowski sum1. Numerically robust means that the symmetric difference with the ideal exact output is small. Cascaded means that the numerical representation has bounded complexity so that the output can become the input again. So called ECG (Exac...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

A novel vedic divider based crypto-hardware for nanocomputing paradigm: An extended perspective

Restoring and non-restoring divider has become widely applicability in the era of digital computing application due to its computation speed. In this paper, we have proposed the design of divider of different architecture for the computation of Vedic sutra based. The design of divider in the Vedic mode results in high computation throughput due to its replica architecture, where latency is mini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2014